Computable concurrent processes
نویسندگان
چکیده
منابع مشابه
On the Relations Computable by a Classof Concurrent
We consider monotone input/output automata, which model a usefully large class of dataaow networks of indeterminate (or nonfunctional) processes. We obtain a characterization of the relations computable by these automata, which states that a relation R : X ! 2 Y (viewed as a \nondeterministic function") is the in-put/output relation of an automaton ii there exists a certain kind of Scott domain...
متن کاملComposing Concurrent Processes
The execution of concurrent programs written in many concurrent logic programming languages can be depicted as the parallel execution of processes accessing in some way a common global data structure. As an example, the cc family of languages ((9]) has as data structure a so-called store composed of constraints. It is accessed by means of the tell primitive, which adds the told constraint to th...
متن کاملMarkov Concurrent Processes
We introduce a model for probabilistic systems with concurrency. The system is distributed over two local sites. Global trajectories of the system are composed of local trajectories glued along synchronizing points. Global trajectories are thus given as partial orders of events, and not as paths. As a consequence, time appears as a dynamic partial order, contrasting with the universal chain of ...
متن کاملCommunicating Concurrent Processes
Process algebra CSP only permits a process to engage in one event on a moment and records this single event into the traces of the process. CSP cannot process events simultaneously, it treat the events occurred simultaneously as one single event. We modify CSP to process the events occurred simultaneously, which is called communicating concurrent processes (CCP).
متن کاملStrategies as Concurrent Processes
Concurrent strategies are shown to support operations yielding an economic yet rich higher-order concurrent process language, which shares features both with process calculi and nondeterministic dataflow. Its operational semantics and ‘may and must’ equivalence require that we take internal (neutral) moves seriously, leading to the introduction of ‘partial strategies’ which may contain neutral ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00117-2